Multicolored parallelisms of Hamiltonian cycles
نویسندگان
چکیده
A subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this paper, we prove that a complete graph on 2m + 1 vertices K2m+1 can be properly edge-colored with 2m+ 1 colors in such a way that the edges of K2m+1 can be partitioned intommulticolored Hamiltonian cycles. © 2009 Published by Elsevier B.V.
منابع مشابه
Multicolored Parallelisms of Isomorphic Spanning Trees
A subgraph in an edge-colored graph is multicolored if all its edges receive distinct colors. In this paper, we prove that a complete graph on 2m (m = 2) vertices K2m can be properly edge-colored with 2m − 1 colors in such a way that the edges of K2m can be partitioned into m multicolored isomorphic spanning trees.
متن کاملBifurcation of limit cycles from a quadratic reversible center with the unbounded elliptic separatrix
The paper is concerned with the bifurcation of limit cycles in general quadratic perturbations of a quadratic reversible and non-Hamiltonian system, whose period annulus is bounded by an elliptic separatrix related to a singularity at infinity in the poincar'{e} disk. Attention goes to the number of limit cycles produced by the period annulus under perturbations. By using the appropriate Picard...
متن کاملMonochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
We conjecture that for any fixed r and sufficiently large n, there is a monochromatic Hamiltonian Bergecycle in every (r − 1)-coloring of the edges of K n , the complete r-uniform hypergraph on n vertices. We prove the conjecture for r = 3, n 5 and its asymptotic version for r = 4. For general r we prove weaker forms of the conjecture: there is a Hamiltonian Berge-cycle in (r−1)/2 -colorings of...
متن کاملOn cycles in intersection graphs of rings
Let $R$ be a commutative ring with non-zero identity. We describe all $C_3$- and $C_4$-free intersection graph of non-trivial ideals of $R$ as well as $C_n$-free intersection graph when $R$ is a reduced ring. Also, we shall describe all complete, regular and $n$-claw-free intersection graphs. Finally, we shall prove that almost all Artin rings $R$ have Hamiltonian intersection graphs. ...
متن کاملUpper Bounds for the Number of Hamiltonian Cycles
Abstract. An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is established first in this paper, which is tighter than the famous Minc’s bound and the Brégman’s bound. A transformation on graphs is proposed, so that counting the number of Hamiltonian cycles of an undirected graph can be done by counting the number of Hamiltonian cycles of its corresponding symmetric dire...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009